The minimum number of vertices with girth 6 and degree set D={r,m}
نویسندگان
چکیده
منابع مشابه
The minimum number of vertices with girth 6 and degree set D={r, m}
A (D; g)-cage is a graph having the minimum number of vertices, with degree set D and girth g. Denote by f(D; g) the number of vertices in a (D; g)-cage. In this paper it is shown that f({r; m}; 6)¿ 2(rm−m+ 1) for any 26 r ¡m, and f({r; m}; 6) = 2(rm−m+ 1) if either (i) 26 r6 5 and r ¡m or (ii) m − 1 is a prime power and 26 r ¡m. Upon these results, it is conjectured that f({r; m}; 6) = 2(rm− m...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملExtraconnectivity of graphs with large minimum degree and girth
The extraconnectivity ~,-(n) of a simple connected graph G is a kind of conditional connectivity which is the minimum cardinality of a set of vertices, if any, whose deletion disconnects G in such a way that every remaining component has more than n vertices. The usual connectivity and superconnectivity of G correspond to K(0) and 1<(1), respectively. This paper gives sufficient conditions, rel...
متن کاملdiameter two graphs of minimum order with given degree set
the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00758-6